Nanopatterned hard/soft bilayer magnetic antidot arrays with long-range periodicity
نویسندگان
چکیده
منابع مشابه
Josephson Junction Arrays with Long-Range Interactions
We calculate the current-voltage (IV ) characteristics of a Josephson junction array with long-range interactions. The array consists of two sets of equally-spaced parallel superconducting wires placed at right angles. A Josephson junction is formed at every point wherever the wires cross. We treat each such junction as an overdamped resistively-shunted junction, and each wire segment between t...
متن کاملBandgap scaling in bilayer graphene antidot lattices.
On the basis of a tight binding model we reveal how the bandgap in bilayer graphene antidot lattices (GALs) follows a different scaling law than in monolayer GALs and we provide an explanation using the Dirac model. We show that previous findings regarding the criteria for the appearance of a bandgap in monolayer GALs are equally applicable to the bilayer case. Furthermore, we briefly investiga...
متن کاملMagnetization reversal in cobalt antidot arrays
We have carried out a detailed study of the magnetic switching in square lattice cobalt antidot arrays with periods ranging from 2 m down to 200 nm antidot size=antidot separation . Magneto-optical Kerr effect measurements show first a small change in the magnetization due to a reversible rotation of the magnetic spins in the antidot rows, followed by a large change due to reversal of the antid...
متن کاملPhotoluminescent Arrays of Nanopatterned Monolayer MoS2
Monolayer 2D MoS2 grown by chemical vapor deposition is nanopatterned into nanodots, nanorods, and hexagonal nanomesh using block copolymer (BCP) lithography. The detailed atomic structure and nanoscale geometry of the nanopatterned MoS2 show features down to 4 nm with nonfaceted etching profiles defined by the BCP mask. Atomic resolution annular dark field scanning transmission electron micros...
متن کاملPeriodicity in Rectangular Arrays
We discuss several two-dimensional generalizations of the familiar Lyndon-Schützenberger periodicity theorem for words. We consider the notion of primitive array (as one that cannot be expressed as the repetition of smaller arrays). We count the number of m×n arrays that are primitive. Finally, we show that one can test primitivity and compute the primitive root of an array in linear time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Magnetism and Magnetic Materials
سال: 2020
ISSN: 0304-8853
DOI: 10.1016/j.jmmm.2019.166142